Cross-Domain Attribute-Based Access Control Encryption

Logic access control enforces who can read and write data; the enforcement is typically performed by a fully trusted entity. At TCC 2016, Damgård et al. proposed Access Control Encryption (ACE) schemes where predicate function decides whether or not users (decrypt) (encrypt) data, while message secrecy users’ anonymity are preserved against malicious parties. Subsequently, several ACE constructions with an arbitrary identity-based policy have been proposed, but they huge ciphertext key sizes and/or rely on indistinguishability obfuscation. IEEE S&P 2021, Wang Chow Cross-Domain scheme constant-size policy; generators separated into two distinct parties, called Sender Authority Receiver Authority. In this paper, we improve over their work novel construction that provides more expressive based attributes rather than identities, security of which relies standard assumptions. Our generic combines Structure-Preserving Signatures, Non-Interactive Zero-Knowledge proofs, Re-randomizable Ciphertext-Policy Attribute-Based schemes. Moreover, propose efficient in ciphertexts encryption decryption keys constant thus independent number receivers attributes. experiments demonstrate only our system flexible, it also results shorter (reduced from about 100 to 47 bytes) 1400 1047).